Court's conjecture on $n+2$ points in $[n]$

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mazur's Conjecture on higher Heegner points

In this article, we establish a non-triviality statement for Heegner points which was conjectured by B. Mazur [10], and has subsequently been used as a working hypothesis by a few authors in the study of the arithmetic of elliptic curves.

متن کامل

GLY Conjecture on Counting number of integral points in a general n-dimensional tetrahedra

Recently there has been tremendous interest in counting the number of integral points in n-dimensional tetrahedra with non-integral vertice due to its applications in primality testing and factoring in number theory and in singularities theory. The purpose of this paper is to summarize our previous works. A conjecture on sharp upper estimate of the number of integral points in n-dimensional tet...

متن کامل

Heegner points and Sylvester’s conjecture

We consider the classical Diophantine problem of writing positive integers n as the sum of two rational cubes, i.e. n = x3 + y3 for x, y ∈ Q. A conjecture attributed to Sylvester asserts that a rational prime p > 3 can be so expressed if p ≡ 4, 7, 8 (mod 9). The theory of mock Heegner points gives a method for exhibiting such a pair (x, y) in certain cases. In this article, we give an expositor...

متن کامل

On the Abc Conjecture and Diophantine Approximation by Rational Points

We show that an earlier conjecture of the author, on diophantine approximation of rational points on varieties, implies the “abc conjecture” of Masser and Oesterlé. In fact, a weak form of the former conjecture is sufficient, involving an extra hypothesis that the variety and divisor admit a faithful group action of a certain type. Analogues of this weaker conjecture are proved in the split fun...

متن کامل

Goppa’s conjecture and counting points on hyperelliptic curves

A long standing problem has been to develop “good” binary linear codes to be used for error-correction. We show in this paper that the Goppa conjecture regarding “good” binary codes is incompatible with a conjecture on the number of points of hyperelliptic curves over finite fields of odd prime order. This rest of this introduction is devoted to explaining the precise result. Let C denote a bin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Časopis pro pěstování matematiky

سال: 1965

ISSN: 0528-2195

DOI: 10.21136/cpm.1965.117539